When Coevolutionary Algorithms Exhibit Evolutionary Dynamics
نویسنده
چکیده
The task of understanding the dynamics of coevolutionary algorithms or comparing performance between such algorithms is complicated by the fact the internal fitness measures are subjective. Though a variety of techniques have been proposed to use external or objective measures to help in analysis, there are clearly properties of fitness payoff (e.g., intransitivity) which call such methods into question in certain contexts. We present a model of competitive fitness assessment with a single population and non-parametric selection (such as tournament selection), and show minimum conditions and examples under which an objective measure exists, and when the dynamics of the coevolutionary algorithm are identical to those of a traditional EA. We also discuss terminological difficulties in the coevolution literature, and present a detailed description of external measures presently in use in the literature.
منابع مشابه
Combating Coevolutionary Disengagement by Reducing Parasite Virulence
While standard evolutionary algorithms employ a static, absolute fitness metric, coevolutionary algorithms assess individuals by their performance relative to populations of opponents that are themselves evolving. Although this arrangement offers the possibility of avoiding long-standing difficulties such as premature convergence, it suffers from its own unique problems, cycling, over-focusing ...
متن کاملGame Theory Based Coevolutionary Algorithm: A New Computational Coevolutionary Approach
Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zerosum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann’s theorem. Another central achievement of game theory i...
متن کاملCoevolutionary Principles
Coevolutionary algorithms approach problems for which no function for evaluating potential solutions is present or known. Instead, algorithms rely on the aggregation of outcomes from interactions among evolving entities in order to make selection decisions. Given the lack of an explicit yardstick, understanding the dynamics of coevolutionary algorithms, judging whether a given algorithm is prog...
متن کاملFunction Optimization with Coevolutionary Algorithms
The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with anothe...
متن کاملEvidence of Coevolution in Multi-objective Evolutionary Algorithms
This paper demonstrates that simple yet important characteristics of coevolution can occur in evolutionary algorithms when only a few conditions are met. We find that interaction-based fitness measurements such as fitness (linear) ranking allow for a form of coevolutionary dynamics that is observed when 1) changes are made in what solutions are able to interact during the ranking process and 2)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002